Search Algorithms in Intelligent Agents
نویسندگان
چکیده
In a distributed system, the task of finding relevant information and services in a timely manner is complex. When using traditional searching techniques across heterogeneous systems and multiple data formats, this task becomes nearly impossible. This paper will examine intelligent search algorithms that can be used to perform fast and reliable distributed searches. Some of the algorithms examined will be the Generate-and-Test, BestFirst, A*, and Means-Ends searches. After reviewing some intelligent distributed search techniques, an example of how these techniques can be used within an emerging distributed system called the "Semantic Web" will be presented. In this system, RDF (Resource Definition Framework) metadata in the form of URIs (Uniform Resource Indicator) and XML are used to give semantic meaning to data and services. This metadata is connected via a domain-common vocabulary, or ontology, defined using OWL (Web Ontology Language). Machines can use this vocabulary to intelligently connect and derive meaning from related data. Also included is an example of semantic search. In closing, the reader will find comparison of various algorithms from space and time domain point of view.
منابع مشابه
AN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کاملFIXED-WEIGHT EIGENVALUE OPTIMIZATION OF TRUSS STRUCTURES BY SWARM INTELLIGENT ALGORITHMS
Meta-heuristics have already received considerable attention in various engineering optimization fields. As one of the most rewarding tasks, eigenvalue optimization of truss structures is concerned in this study. In the proposed problem formulation the fundamental eigenvalue is to be maximized for a constant structural weight. The optimum is searched using Particle Swarm Optimization, PSO and i...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملNovel Hybrid Fuzzy-Intelligent Water Drops Approach for Optimal Feeder Multi Objective Reconfiguration by Considering Multiple-Distributed Generation
This paper presents a new hybrid method for optimal multi-objective reconfiguration in a distribution feeder in addition to determining the optimal size and location of multiple-Distributed Generation (DG). The purposes of this research are mitigation of losses, improving the voltage profile and equalizing the feeder load balancing in distribution systems. To reduce the search space, the improv...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کامل